Exact Quantum Query Complexity of \text EXACT_k, l^n
نویسندگان
چکیده
In the exact quantum query model a successful algorithm must always output the correct function value. We investigate the function that is true if exactly k or l of the n input bits given by an oracle are 1. We find an optimal algorithm (for some cases), and a nontrivial general lower and upper bound on the minimum number of queries to the black box.
منابع مشابه
Quantum Pattern Matching
Finding a match (or nearest match) of an M item pattern against an N item text is a common computing task, useful in string matching and image matching. The best classical (i.e., non-quantum) string matching algorithms, which are Θ(N+M) time and query complexity, are improved in many cases in this paper using Grover’s quantum searching algorithm. Specifically, given quantum oracles that return ...
متن کاملRobust String Matching in O ( √ N + M ) Quantum Queries Chris
Finding a match of an M item pattern against an N item text is a common computing task, useful in string matching and image matching. The best classical (i.e., non-quantum) string matching algorithms, which are Θ(N +M) time and query complexity, are improved in many cases in this paper using Grover’s quantum searching algorithm. Specifically, given quantum oracles that return the j symbol in th...
متن کاملCharacterizations of symmetrically partial Boolean functions with exact quantum query complexity
We give and prove an optimal exact quantum query algorithm with complexity k+ 1 for computing the promise problem (i.e., symmetric and partial Boolean function) DJ n defined as: DJ k n(x) = 1 for |x| = n/2, DJ n(x) = 0 for |x| in the set {0, 1, . . . , k, n − k, n − k + 1, . . . , n}, and it is undefined for the rest cases, where n is even, |x| is the Hamming weight of x. The case of k = 0 is t...
متن کاملExact quantum algorithms have advantage for almost all Boolean functions
It has been proved that almost all n-bit Boolean functions have exact classical query complexity n. However, the situation seemed to be very different when we deal with exact quantum query complexity. In this paper, we prove that almost all n-bit Boolean functions can be computed by an exact quantum algorithm with less than n queries. More exactly, we prove that ANDn is the only n-bit Boolean f...
متن کاملRobust String Matching in O ( √
Finding a match of an M item pattern against an N item text is a common computing task, useful in string matching and image matching. The best classical (i.e., non-quantum) string matching algorithms, which are Θ(N +M) time and query complexity, are improved in many cases in this paper using Grover’s quantum searching algorithm. Specifically, given quantum oracles that return the jth symbol in ...
متن کامل